On orienting graphs for connectivity: Projective planes and Halin graphs
نویسندگان
چکیده
منابع مشابه
On orienting graphs for connectivity: Projective planes and Halin graphs
Nash-Williams proved that the edges of a k-edge connected (undirected) graph can be oriented such that the resulting directed graph is ⌊ 2 ⌋-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity, element connectivity, and hypergraph edge connectivity. We focus on two special classes of graphs, namely, incidence...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملGraphs embedded into finite projective planes
We study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs and the existence of certain substructures in a plane, such as Baer subplanes and arcs.
متن کاملGraphs for Orthogonal Arrays and Projective Planes of Even Order
We consider orthogonal arrays of strength two and even order q having n columns which are equivalent to n − 2 mutually orthogonal Latin squares of order q. We show that such structures induce graphs on n vertices, invariant up to complementation. Previous methods worked only for single Latin squares of even order and were harder to apply. If q is divisible by four the invariant graph is simple ...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2012
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.06.004